A tight bound for point guards in piecewise convex art galleries

نویسندگان

  • Javier Cano
  • Csaba D. Tóth
  • Jorge Urrutia
چکیده

We consider the problem of guarding curvilinear art galleries. A closed arc a joining two points, p and q, in the plane is called a convex arc if the curve obtained by joining a with the line segment pq encloses a convex set. A piece-wise convex polygon P with vertices v0, . . . , vn−1 is the region bounded by a set {a0, . . . , an−1} of n convex arcs with pairwise disjoint interiors such that ai joins vi to vi+1, addition taken mod n, each of them convex with respect to the interior of P . A piece-wise convex art gallery is the connected region bounded by a piece-wise convex polygon. We show that dn2 e point guards are always sufficient in order to guard a piece-wise convex art gallery. This bound is best possible.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Guarding curvilinear art galleries with vertex

10 One of the earliest and most well known problems in computational geometry is 11 the so-called art gallery problem. The goal is to compute the minimum number of 12 guards needed to cover the interior of any polygon with n vertices; the guards are 13 to be placed on the vertices of the polygon. We consider the problem of guarding an 14 art gallery which is modeled as a polygon with curvilinea...

متن کامل

Guarding curvilinear art galleries with vertex or point guards

One of the earliest and most well known problems in computational geometry is the socalled art gallery problem. The goal is to compute the minimum possible number guards placed on the vertices of a simple polygon in such a way that they cover the interior of the polygon. In this paper we consider the problem of guarding an art gallery which is modeled as a polygon with curvilinear walls. Our ma...

متن کامل

Allocating Vertex π - Guards in Simple Polygons via Pseudo - Triangulations ∗

We use the concept of pointed pseudo-triangulations to establish new upper and lower bounds on a well known problem from the area of art galleries: What is the worst case optimal number of vertex π -guards that collectively monitor a simple polygon with n vertices? Our results are as follows: 1. Any simple polygon with n vertices can be monitored by at most n/2 general vertex π -guards. This bo...

متن کامل

Guarding curvilinear art galleries with edge or mobile guards via 2-dominance of triangulation graphs

In this paper we consider the problem of monitoring an art gallery modeled as a polygon, the edges of which are arcs of curves, with edge or mobile guards. Our focus is on piecewise-convex polygons, i.e., polygons that are locally convex, except possibly at the vertices, and their edges are convex arcs. We transform the problem of monitoring a piecewise-convex polygon to the problem of 2dominat...

متن کامل

Mobile vs. point guards

We study the problem of guarding orthogonal art galleries with horizontal mobile guards (alternatively, vertical) and point guards, using “rectangular vision”. We prove a sharp bound on the minimum number of point guards required to cover the gallery in terms of the minimum number of vertical mobile guards and the minimum number of horizontal mobile guards required to cover the gallery. Further...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Geom.

دوره 46  شماره 

صفحات  -

تاریخ انتشار 2013